A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion

Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of underlying distributed system, and the deadlock can occur between requesting processes. In this paper, we present a quorum-based distributed mutual exclusion algorithm, free deadlock. Every group is organized as a logical ring of processes. A requesting process sends its request to its successor on the logical ring. When a process receives its own request after one round, it enters in the critical section. The algorithm requires